On conditions under which isometries have bounded orbits

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Ideals Which Have the Weakly Insertion of Factors Property

A one-sided ideal of a ring has the insertion of factors property (or simply, IFP) if implies r for . We say a one-sided ideal of has the weakly IFP if for each , implies , for some non-negative integer . We give some examples of ideals which have the weakly IFP but have not the IFP. Connections between ideals of which have the IFP and related ideals of some ring extensions a...

متن کامل

When mothers have favourites: conditions under which mothers differentiate among their adult children.

Research has shown that mothers often differentiate among their adult children in terms of closeness and support; however, studies have not addressed why some mothers report preferences among children and others do not. To distinguish between mothers who do and do not report favouring some of their adult children, we used data from a within-family study in which 553 older mothers were interview...

متن کامل

On the Conditions under which Audit Risk Increases with Information

It has been reported in the literature on strategic auditing that audit risk (the probability of audit failure) may increase when the auditor obtains information, whereas conditions for such cases have not been identified as yet. This paper provides simple models to analyze the general tendencies of exogenous parameters for such cases. The analysis shows that audit risk increases with more info...

متن کامل

Permutation codes invariant under isometries

The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1984

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-48-2-219-227